Lower bound for balanced sets
نویسندگان
چکیده
منابع مشابه
Lower Bound Theorems and a Generalized Lower Bound Conjecture for balanced simplicial complexes
A (d − 1)-dimensional simplicial complex is called balanced if its underlying graph admits a proper d-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we prove the balanced analog of the celebrated Lower Bound Theorem for normal pseudomanifolds and characterize the case of equality; we introduce and ch...
متن کاملA Lower Bound on Opaque Sets
We prove a lower bound of 2.00002 on the the total length of a set (of curves) that intersects every line that intersects the unit square. The best known lower bound has been 2, established by Jones in 1964.
متن کاملA sharp lower bound for locating-dominating sets in trees
Let LD(G) denote the minimum cardinality of a locating-dominating set for graph G. If T is a tree of order n with l leaf vertices and s support vertices, then a known lower bound of Blidia, Chellali, Maffray, Moncel and Semri [Australas. J. Combin. 39 (2007), 219–232] is LD(T ) ≥ (n+ 1 + l − s)/3 . In this paper, we show that LD(T ) ≥ (n+ 1 + 2(l − s))/3 and these bounds are sharp. We construct...
متن کاملMaximum Balanced Subgraph Problem Parameterized above Lower Bound
We consider graphs without loops or parallel edges in which every edge is assigned + or −. Such a signed graph is balanced if its vertex set can be partitioned into parts V1 and V2 such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign − (one of the parts may be empty). It is well-known that every connected signed graph with...
متن کاملImproved lower bound on the geometric dilation of point sets
Let G be an embedded planar graph whose edges are curves. The detour between two points p and q (on edges or vertices) of G is the length of a shortest path connecting p and q in G divided by their Euclidean distance |pq|. The maximum detour over all pairs of points is called the geometric dilation δ(G). EbbersBaumann, Grüne and Klein have shown that every finite point set is contained in a pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.016